Genetic Algorithms and Simulated Annealing Applied to the Identification of Hysteresis Models
نویسندگان
چکیده
This paper tests two heuristic approaches by applying them to the magnetic hysteresis model parameter identification. Both Preisach and Jiles-Atherton hysteresis models have been used. The implemented investigated heuristics are genetic algorithm and simulated annealing. Both the heuristic algorithms efforts the knowledge of the B-H experimental points of the hysteresis loop to be modeled according to Preisach or Jiles-Atherton. The implemented software and the performances of two heuristic algorithms are presented. Key-Words: Genetic algorithms, Simulated Annealing, Hysteresis
منابع مشابه
Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling
The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...
متن کاملFew heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...
متن کاملGenetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy
This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...
متن کاملNo-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
متن کاملThe project portfolio selection and scheduling problem: mathematical model and algorithms
This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...
متن کامل